Risk-Bounded Formation of Fuzzy Coalitions Among Service Agents
نویسندگان
چکیده
Cooperative autonomous agents form coalitions in order to share and combine resources and services to efficiently respond to market demands. With the variety of resources and services provided online today, there is a need for stable and flexible techniques to support the automation of agent coalition formation in this context. This paper describes an approach to the problem based on fuzzy coalitions. Compared with a classic cooperative game with crisp coalitions (where each agent is a full member of exactly one coalition), an agent can participate in multiple coalitions with varying degrees of involvement. This gives the agents more freedom and flexibility, allowing them to make full use of their resources, thus maximising utility, even if only comparatively small coalitions are formed. An important aspect of our approach is that the agents can control and bound the risk caused by the possible failure or default of some partner agents by spreading their involvement in diverse coalitions.
منابع مشابه
Coalitions Among Computationally Bounded Agents
This paper analyzes coalitions among self interested agents that need to solve combinatorial optimization problems to operate e ciently in the world By colluding coordinating their actions by solving a joint optimization prob lem the agents can sometimes save costs compared to operating individually A model of bounded rationality is adopted where computation resources are costly It is not worth...
متن کاملMaximal Clique Based Distributed Coalition Formation for Task Allocation in Large-Scale Multi-agent Systems
We present a fully distributed algorithm for coalition formation among autonomous agents. The algorithm is based on two main ideas. One is a distributed computation of maximal cliques (of bounded sizes) in the underlying graph that captures the interconnection communication topology of the agents. Hence, given the current configuration of the agents, the coalitions that are formed are character...
متن کاملCoalition Formation among Bounded Rational Agents
This paper analyzes coalitions among self-interested agents that need to solve combinatorial optimization problems to operate e ciently in the world. By colluding (coordinating their actions by solving a joint optimization problem), the agents can sometimes save costs compared to operating individually. A model of bounded rationality is adopted, where computation resources are costly. It is not...
متن کاملFeasible formation of coalitions among autonomous agents in non-super-additive environments
Cooperating and sharing resources by creating coalitions of agents are an important way for autonomous agents to execute tasks and to maximize payo . Such coalitions will form only if each member of a coalition gains more if it joins the coalition than it could gain otherwise. There are several ways of creating such coalitions and dividing the joint payo among the members. In this paper we pres...
متن کاملBSCA-P: Privacy Preserving Coalition Formation
In the setting of cooperation of rational web service agents via coalition formation, we devise an algorithm BSCA-P to form recursively bilateral Shapley value stable coalitions. The main focus lies on privacy aspects: we show that the BSCA-P enables the formation of subgame stable and individually rational coalitions while hiding absolute coalition values and payoffs, as well as allowing for a...
متن کامل